An improved cuckoo search algorithm for the problem of electric distribution network reconfiguration

Power loss reduction has an important role in operating electric distribution network system. There are a lot of methods for reduction power loss such as capacitor placement, distributed generation placement and electric distribution network reconfiguration (EDNR). Among these methods, the EDNR is an efficient technique to reduce power loss due to without taking any costs. However, the EDNR problem is a nonlinear, discrete problem and lots of extreme points. Therefore, it is necessary to have efficient methods for solving the EDNR problem. In this paper, an improved cuckoo search algorithm (ICSA) is proposed for solving the EDNR problem. In which, based on disadvantages of exploration and exploitation process of cuckoo search algorithm (CSA) for solving the EDNR problem, a local search mechanism is added to exploit candidate solutions existing around the current best solution. The calculated results on the simple distribution networks to complex distribution networks show that ICSA has ability for finding the global optimal solution with much smaller iterations and better quality of obtained solution compared with CSA and some other improved versions of CSA. The performance comparisons with other existing methods available in previous studies and the software of Power System Simulator/Advanced Distribution Engineering Productivity Tool (PSS/ADEPT) also lead to the better electric distribution network configuration with smaller total power losses. As a result, ICSA is a potential and reliable method for solving the EDNR problems.     

An integrated approach for aircraft turbofan engine fault detection based on data mining techniques

The present study proposes an algorithm for fault detection in terms of condition‐based maintenance with data mining techniques. The proposed algorithm is applied on an aircraft turbofan engine using flight data and consists of two main sections. In the first section, the relationship between engine exhaust gas temperature (EGT) as the main engine health monitoring criterion and other operational and environmental parameters of the engine was modelled using the data‐driven models. In the second section, a data set including EGT residuals, that is, the difference between the actual EGT of the system and the EGT estimated by the developed model in the health conditions of the engine, was created. Finally, faults occurring in each flight were detected based on the identification of abnormal events by a one‐class support vector machine trained by the health condition EGT residual data set. The results indicated that the proposed algorithm was an effective approach for inspecting aircraft engine conditions and detecting faults, with no need for technical knowledge on the interior characteristics of the aircraft engine.     

基于深度学习的四旋翼无人机单目视觉避障方法

针对无人机避障问题，提出一种基于深度学习的四旋翼无人机单目视觉避障方法。首先通过目标检测框选出目标在图像中的位置，并通过计算目标选框上下边距的长度，以此来估量出障碍物到无人机之间的距离；然后通过协同计算机判断是否执行避障动作；最后使用基于Pixhawk搭建的飞行实验平台进行实验。实验结果表明，该方法可用于无人机低速飞行条件下避障。该方法所用到的传感器只有一块单目摄像头，而且相对于传统的主动式传感器避障方法，所占用无人机的体积大幅减小。该方法鲁棒性较好，能够准确识别不同姿态的人，实现对人避障。     

基于同轴图像传感的激光焊接过程质量监测技术

针对激光焊接过程中由于参数不匹配、装配误差等原因造成的焊接过程不稳定等焊接缺陷，基于同轴图像传感技术，建立起一套激光焊接过程中的质量在线监测系统，对焊接过程中的熔池图像进行了采集分析及其熔池特征信息的提取. 结果表明，在激光功率为1 500 W的不等厚不锈钢薄板激光焊接试验条件下，焊接过程中的不稳定、下塌缺陷以及焊偏现象与熔池形状各特征信息变化具有一定的相关性. 结合BP神经网络算法对所提特征信息进行分类、识别，基于LabVIEW软件平台，可实现相应缺陷的自动化识别及报警功能.     

ATSP:时态网络可视化的自适应时间片划分方法

现有的时态网络可视化方法大多采用等量时间片来可视化网络的演变，不利于时态模式的快速挖掘和发现。为此，根据时态网络固有的特征提出自适应时间片划分方法（Adaptive Time Slice Partition method，ATSP）。在时态网络的两种表示方式（基于事件的表示方式和基于快照的表示方式）的基础上，构建了ATSP的基础模型，同时提出了一种改进模型用来描述事件间隔时间服从长尾分布的时态网络。为了实现时间片的不等量划分，针对探索任务的不同提出了基于时态模式的ATSP规则和基于中心节点的ATSP规则，并提出了实现算法--层次划分算法（Hierarchical Partition algorithm，HP）和增量划分算法（Incremental Partition algorithm，IP）。实验结果表明，ATSP方法比传统的时间片划分方法更能准确地表示网络的时态特征，且该方法应用于可视化时，能有效归纳并展示网络的特征，明显提高了视觉分析的效率。     

大规模生物网络马尔可夫聚类的并行化算法

马尔可夫聚类算法（MCL）是在大规模生物网络中寻找模块的一个有效方法，能够挖掘网络结构和功能影响力较大的模块。算法涉及到大规模矩阵计算，因此复杂度可达立方阶次。针对复杂度高的问题，提出了基于消息传递接口（MPI）的并行化马尔可夫聚类算法以提高算法的计算性能。首先，生物网络转化成邻接矩阵；然后，根据算法的特性，按照矩阵的规模判断并重新生成新矩阵以处理非平方倍数矩阵的计算；其次，并行计算通过按块分配的方式能够有效地实现任意规模矩阵的运算；最后，循环并行计算直至收敛，得到网络聚类结果。通过模拟网络和真实生物网络数据集的实验结果表明，与全块集体式通信（FCC）并行方法相比，平均并行效率提升了10个百分点以上，因此可以将该优化算法应用在不同类型的大规模生物网络中。     

基于张量分解融合RGB-D图像的物体识别

为了充分利用RGB-D图像的深度图像信息，提出了基于张量分解的物体识别方法。首先将RGB-D图像构造成一个四阶张量，然后将该四阶张量分解为一个核心张量和四个因子矩阵，再利用相应的因子矩阵将原张量进行投影，获得融合后的RGB-D数据，最后输入到卷积神经网络中进行识别。RGB-D数据集中三组相似物体的识别结果表明，利用张量分解融合RGB-D图像的物体识别准确率高于未采用张量分解的物体识别准确率，并且单一错分实例的准确率最高可提升99%。     

基于动态距离的模糊社区识别算法

社区识别技术是公共安全领域潜在危害行为预警预测和已发生危害行为追踪溯源的基础，针对传统社区识别算法将社区视作单一集合而无法描述社区主次成员的问题，提出一种基于动态距离的模糊社区识别算法。该算法将传统的单一社区结构划分为核心区域和边际区域，以边际区域来描述社区的模糊区间。该算法首先将网络设想为动态演变模型，网络中的任意节点均会与其他节点产生互动，互动将改变各节点间距离，距离也反过来影响互动。在阈值的界定下，受到多个社区吸引的节点被划分到边际区域，最终距离分布趋于稳定，各个社区结构得以显现。通过对比实验验证了CDFDD算法在社区识别上的有效性。     

Hierarchical sampling optimization of particle filter for global robot localization in pervasive network environment

This paper presents a hierarchical framework for managing the sampling distribution of a particle filter (PF) that estimates the global positions of mobile robots in a large‐scale area. The key concept is to gradually improve the accuracy of the global localization by fusing sensor information with different characteristics. The sensor observations are the received signal strength indications (RSSIs) of Wi‐Fi devices as network facilities and the range of a laser scanner. First, the RSSI data used for determining certain global areas within which the robot is located are represented as RSSI bins. In addition, the results of the RSSI bins contain the uncertainty of localization, which is utilized for calculating the optimal sampling size of the PF to cover the regions of the RSSI bins. The range data are then used to estimate the precise position of the robot in the regions of the RSSI bins using the core process of the PF. The experimental results demonstrate superior performance compared with other approaches in terms of the success rate of the global localization and the amount of computation for managing the optimal sampling size.     

Topological Characterization of Book Graph and Stacked Book Graph

Degree based topological indices are being widely used in computer-aided modeling, structural activity relations, and drug designing to predict the underlying topological properties of networks and graphs. In this work, we compute the certain important degree based topological indices like Randic index, sum connectivity index, ABC index, ABC₄ index, GA index and GA₅ index of Book graph B_n and Stacked book graph B_m,n. The results are analyzed by using edge partition, and the general formulas are derived for the above-mentioned families of graphs.